Approximation algorithms - PDFSEARCH.IO - Document Search Engine

Approximation algorithms
Results: 332

#	Item
31	Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs David Eppstein∗ Abstract dynamic closest pair problem. It can be solved by brute force 2 We develop data structures for dynamic closest pair Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Mathematics Statistics Applied mathematics Data mining Search algorithms Approximation algorithms Discrete geometry Nearest neighbor search Numerical analysis Hierarchical clustering Cluster analysis K-means clustering
32	Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014 Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2014-06-04 08:46:15 Computational complexity theory Mathematics NP-complete problems Theory of computation Packing problems Operations research Approximation algorithms Knapsack problem Vertex cover Bin packing problem Hardness of approximation Algorithm
33	SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2013-03-13 08:17:47 Computational complexity theory Mathematics NP-complete problems Theory of computation Set cover problem Approximation algorithm Algorithm Analysis of algorithms Bin packing problem Vertex cover
34	Algorithms and Data Structures (WS15/16) Example Solutions for Unit 4 Problem 1 skipped Add to Reading List Source URL: www-tcs.cs.uni-sb.de Language: English - Date: 2016-03-04 12:26:59 Mathematics Mathematical analysis Mathematical induction Integer sequences Approximation theory Mathematical series Binomial coefficient Aurifeuillean factorization
35	Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:48:33 Graph theory Mathematics Computational complexity theory NP-hard problems NP-complete problems Edsger W. Dijkstra Combinatorial optimization Approximation algorithms Travelling salesman problem Shortest path problem Matching Randomized algorithm
36	A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility Add to Reading List Source URL: tandy.cs.illinois.edu Language: English - Date: 2015-04-08 19:35:45 Computational complexity theory Theory of computation Complexity classes NP-complete problems Combinatorial optimization Packing problems Approximation algorithms Knapsack problem NP APX
37	Efficient Optimization of Many Objectives by Approximation-Guided Evolution Markus Wagnerc,∗, Karl Bringmanna , Tobias Friedrichb , Frank Neumannc a Max-Planck-Institut f¨ Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:48:47 Mathematical optimization Computational complexity theory Theory of computation Applied mathematics Academia Evolutionary algorithms Operations research Cybernetics Multi-objective optimization Reduction Algorithm CMA-ES
38	The Entropy Rounding Method in Approximation Algorithms Thomas Rothvoß Department of Mathematics, M.I.T. Carg`ese 2011 Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Algorithms Randomized rounding Rounding Mathematics Academia Applied mathematics
39	Efficient algorithms for sequence segmentation Evimaria Terzi ∗ Panayiotis Tsaparas † The error in this approximate representation is measured using some error function, e.g. the sum of squares. Different Add to Reading List Source URL: www.cs.uoi.gr Language: English - Date: 2006-01-26 11:38:44 Systems science Mathematics Image segmentation Dynamic programming Algorithm Systems theory Approximation algorithm Time-series segmentation Graph cuts in computer vision
40	I will discuss recent work on randomized algorithms for low-rank approximation and principal component analysis (PCA). The talk will focus on efforts that move beyond the extremely fast, but relatively crude approximatio Add to Reading List Source URL: mmds-data.org Language: English - Date: 2016-06-23 15:50:48 Algebra Mathematics Multivariate statistics Numerical analysis Numerical linear algebra Iterative methods Dimension reduction Principal component analysis Singular value decomposition Stochastic optimization Nonlinear dimensionality reduction Sparse dictionary learning

UPDATE